A General Setting for the Parametric Google Matrix
نویسندگان
چکیده
منابع مشابه
A General Setting for the Parametric Google Matrix
The spectral and Jordan structures of the web hyperlink matrix G(c) = cG + (1 − c)ev have been analyzed when G is the basic (stochastic) Google matrix, c is a real parameter such that 0 < c < 1, v is a nonnegative probability vector, and e is the all-ones vector. Typical studies have relied heavily on special properties of nonnegative, positive, and stochastic matrices. There is a unique nonneg...
متن کاملDelocalization transition for the Google matrix
We study the localization properties of eigenvectors of the Google matrix, generated both from the world wide web and from the Albert-Barabási model of networks. We establish the emergence of a delocalization phase for the PageRank vector when network parameters are changed. For networks with localized PageRank, eigenvalues of the matrix in the complex plane with a modulus above a certain thres...
متن کاملToxoplasmosis in Iran: A guide for general physicians working in the Iranian health network setting: A systematic review
Background: Human toxoplasmosis is an important zoonotic infection worldwide which is caused by the intracellular parasite Toxoplasma gondii (T.gondii). The aim of this study was to review briefly the general aspects of toxoplasma infection in in Iranian health system network. Methods: We searched published toxoplasmosis related articles in English databases including Science Dir...
متن کاملGoogle matrix of Twitter
We construct the Google matrix of the entire Twitter network, dated by July 2009, and analyze its spectrum and eigenstate properties including the PageRank and CheiRank vectors and 2DRanking of all nodes. Our studies show much stronger inter-connectivity between top PageRank nodes for the Twitter network compared to the networks of Wikipedia and British Universities studied previously. Our anal...
متن کاملAnderson transition for Google matrix eigenstates
We introduce a number of random matrix models describing the Google matrix G of directed networks. The properties of their spectra and eigenstates are analyzed by numerical matrix diagonalization. We show that for certain models it is possible to have an algebraic decay of PageRank vector with the exponent similar to real directed networks. At the same time the spectrum has no spectral gap and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Internet Mathematics
سال: 2006
ISSN: 1542-7951,1944-9488
DOI: 10.1080/15427951.2006.10129131